Fast Object Recognition Using Salient Line Groups - Intelligent Robots and Systems, 1998. Proceedings., 1998 IEEE/RSJ International Conference on

نویسنده

  • Dong Jung Kang
چکیده

This paper presents an effective recognition method based on perceptual organization of low level features detected in an image. The method uses a dynamic programming (DP) based formulation to represent various line groups such as convex, concave, and more complex patterns consisting of convex and concave shapes. The essential features of perceptual organization such as endpoint proximity, collinearity, parallelism, and connectivity of lines, are incorporated into the DP based formulation as energy terms. As endpoint proximity, we detect two line junctions from image lines. We then search for junction groups by using collinearity constraint between the junctions. A DP-based search algorithm is used to detect a junction chain similar to the model chain, based on a local comparison. The proposed system is able to find line groups from images with broken lines and strong background clutters. We demonstrate the feasibility of our DP-bused matching method based on perceptual organization using real images. Indexing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-Reconfigurable Molecule Robots as 3D Metamorphic Robots - Intelligent Robots and Systems, 1998. Proceedings., 1998 IEEE/RSJ International Conference on

This paper describes a three-dimensional selfreconfiguring system that is capable of reconfiguration and the associated planning in polynomial tame. The approach is t o reduce a system composed of Molecule Robots [KRVM] to the Metamorphic Robots of [PaChSCh]. Having done so, we are able to apply polynomial-time planning algorithms that have previously been used only in two-dimensional systems.

متن کامل

Motion Planning For Redundant Branching Articulated Figures With Many Degrees Of Freedom

A fast algorithm is presented that can handle the motion planning problem for articulated figures with branches and many degrees of freedom. The algorithm breaks down the degrees of freedom of the figure into Cspace groups and compute the free motion for each of these groups in a sequential fashion. It traverses the tree in a depth first order to compute the motion for all the branches. A speci...

متن کامل

Service Humanoide Roboter

Conferences • IEEE-RAS International Conference on Humanoid Robots (Humanoids), December 1-3, 2008, Daejong, Korea, http://humanoids2008.org • IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS), September, 22-26, 2008, Nice, France, http://iros2008.inria.fr • Robotics: Science and Systems, June 29 July 1, 2009, Seattle, USA, http://www.roboticsconference.org • IEEE ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004